By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 12, Issue 3, pp. 289-412

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

Vineet Bafna, Piotr Berman, and Toshihiro Fujito

pp. 289-297

BibTeX  Abstract Full Text:  PDF

Switching Distance Between Graphs with the Same Degrees

Todd G. Will

pp. 298-306

BibTeX  Abstract Full Text:  PDF

Edge-Bandwidth of Graphs

Tao Jiang, Dhruv Mubayi, Aditya Shastri, and Douglas B. West

pp. 307-316

BibTeX  Abstract Full Text:  PDF

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

Xin He, Ming-Yang Kao, and Hsueh-I Lu

pp. 317-325

BibTeX  Abstract Full Text:  PDF

New Facets of the Linear Ordering Polytope

G. Bolotashvili, M. Kovalev, and E. Girlich

pp. 326-336

BibTeX  Abstract Full Text:  PDF

Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine

Hikoe Enomoto and Miki Shimabara Miyauchi

pp. 337-341

BibTeX  Abstract Full Text:  PDF

Finding Subsets Maximizing Minimum Structures

Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, and Takeshi Tokuyama

pp. 342-359

BibTeX  Abstract Full Text:  PDF

The Linear Extension Diameter of a Poset

Stefan Felsner and Klaus Reuter

pp. 360-373

BibTeX  Abstract Full Text:  PDF

Rankings of Directed Graphs

Jan Kratochvíl and Zsolt Tuza

pp. 374-384

BibTeX  Abstract Full Text:  PDF

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs

András Gyárfás, Zoltán Király, and Jeno Lehel

pp. 385-411

BibTeX  Abstract Full Text:  PDF

Note: An Upper Bound for the Diameter of a Graph

Russell Merris

p. 412

BibTeX  Abstract Full Text:  PDF